-
1 схема доказательства
Русско-английский большой базовый словарь > схема доказательства
-
2 схема доказательства
Русско-английский новый политехнический словарь > схема доказательства
-
3 схема доказательства
Русско-английский военно-политический словарь > схема доказательства
-
4 доказательство
Русско-английский словарь по информационным технологиям > доказательство
-
5 наглядное доказательство
Русско-английский большой базовый словарь > наглядное доказательство
-
6 строгое доказательство
-
7 доказательство
1. proof2. evidenceБизнес, юриспруденция. Русско-английский словарь > доказательство
-
8 представить доказательства
Русско-английский большой базовый словарь > представить доказательства
-
9 привести доказательства
Русско-английский военно-политический словарь > привести доказательства
-
10 решение в аналитическом виде
нормализованная форма; нормализованный вид — normalized form
Русско-английский большой базовый словарь > решение в аналитическом виде
-
11 ветвящееся доказательство
Information technology: tree form proofУниверсальный русско-английский словарь > ветвящееся доказательство
-
12 доказательство в виде дерева
Mathematics: tree form proofУниверсальный русско-английский словарь > доказательство в виде дерева
-
13 доказательство в форме дерева
Information technology: tree form proofУниверсальный русско-английский словарь > доказательство в форме дерева
-
14 без доказательства
1. take for granted2. for grantedсчитать доказанным; принимать без; доказательства — take as granted
Русско-английский большой базовый словарь > без доказательства
См. также в других словарях:
Proof-of-work system — A Proof of work ( POW ) system (or protocol, or function) is an economic measure to deter denial of service attacks and other service abuses such as spams on a network by requiring some work from the service requester, usually meaning processing… … Wikipedia
Tree bog — A Treebog is a form of compost toilet which has willows, nettles and other nutrient hungry plants planted around it. The faeces are held in a chamber open to the air which allows it to decompose rapidly, feeding the trees around it. Unlike a… … Wikipedia
Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… … Wikipedia
Kruskal's tree theorem — In mathematics, Kruskal s tree theorem states that the set of finite trees over a well quasi ordered set of labels is itself well quasi ordered (under homeomorphic embedding). The theorem was proved byharvs|txt=yes|year= 1960 |authorlink=Joseph… … Wikipedia
Double counting (proof technique) — In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which… … Wikipedia
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
List of One Tree Hill episodes — The following is a list of episodes for One Tree Hill, an American television series. One Tree Hill was created by Mark Schwahn, who has also written over a third of the episodes, including each season s premiere and season finale. Schwahn shares … Wikipedia
One Tree Hill (season 8) — One Tree Hill: Season 8 DVD cover art. Country of origin United States No. of episodes … Wikipedia
Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC … Wikipedia